GXL2SVG: Domain-Specific Graph Layout
نویسندگان
چکیده
GXL provides an international standard to exchange graphs and their according schemas, but without offering means to visualize these structures. This paper presents a declarative approach to specify a graph layout by referring to the graphs schema. Using GReQL graph querying technology, the resulting display of graph elements can be influenced by various graph properties. The graph visualizer GXL2SVG uses standard graph layout services and exports graphs as SVG documents.
منابع مشابه
Graph Drawing Aesthetics and the Comprehension of UML Class Diagrams: An Empirical Study
Many existing automatic graph layout algorithms are unrelated to any particular semantic domain. Designers of such algorithms tend to conform to layout aesthetics, and claim that by doing so, the resultant diagram is easy to understand. Few algorithms are designed for a specific domain, and there is no guarantee that the aesthetics used for generic layout algorithms will be useful for the visua...
متن کاملOperations on network-based space layouts for modeling multiple space views of buildings
6 Space layouts are created by designers to model a building’s spaces and related physical objects. Building services designers commonly reuse space layouts created by architectural designers to develop their designs. However, reuse tends to be limited due to differences in designers’ space views. In order to address this issue of modeling multiple space views, we define a set of novel operatio...
متن کاملDrawing Large Graphs with H3Viewer and Site Manager
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI’s Site Manager application. Our layout and drawing algorithms support interactive navigation of large graphs up to 100,000 edges. We present an adaptive drawing algorithm with a guaranteed frame rate. Both layout and navigation occur in 3D hyperbolic sp...
متن کاملSpring Embedders and Force Directed Graph Drawing Algorithms
Force-directed algorithms are among the most flexible methods for calculating layouts of simple undirected graphs. Also known as spring embedders, such algorithms calculate the layout of a graph using only information contained within the structure of the graph itself, rather than relying on domain-specific knowledge. Graphs drawn with these algorithms tend to be aesthetically pleasing, exhibit...
متن کاملVisualization of Traceability Models with Domain-specific Layouting
Traceability models are often used to describe the correspondence between source and target models of model transformations. Although the visual representation of such models are important for transformation development and application, mostly ad-hoc solutions are present in industrial environments. In this paper we present a user interface component for visualizing traceability models inside t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Softwaretechnik-Trends
دوره 26 شماره
صفحات -
تاریخ انتشار 2006